Independent spanning trees in Eisenstein–Jacobi networks

Spanning trees are widely used in interconnection networks for routing, broadcasting, fault-tolerance, and securely delivering messages, as well parallel distributed computing. The problem of efficiently finding a maximal set independent spanning (ISTs) is still open arbitrary (general) topologies (graphs). first contribution this paper presenting two efficient methods that solve the Eisenstein–Jacobi (EJ) networks. constructs three Edge-Disjoint Node-Independent Trees (EDNISTs), whereas second six ISTs but not edge disjoint. Both constructions have time complexity O(n), where n number nodes. providing fault-tolerant routing algorithm based on constructed with O(1) communication O(|P|), P path. experimental results measure maximum average all steps between root node other nodes among consideration possible faulty In addition, comparison shows proposed method outperforms state-of-the-art broadcasting terms coverage presence failures.